Optimal multiple stopping with sum-payoff

نویسنده

  • Andreas Faller
چکیده

We consider the optimal stopping of independent, discrete time sequences X1, . . . , Xn where m stops are allowed. The payoff is the sum of the stopped values. Under the assumption of convergence of related imbedded point processes to a Poisson process in the plane we derive approximatively optimal stopping times and stopping values. The solutions are obtained via a system of m differential equations of first order. As application we consider the case that Xi = ciZi + di with (Zi) i.i.d. in the domain of attraction of an extreme value distribution. We obtain explicit results for stopping values and approximative optimal stopping rules.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stopping Games in Continuous Time

We study two-player zero-sum stopping games in continuous time and infinite horizon. We prove that the value in randomized stopping times exists as soon as the payoff processes are right-continuous. In particular, as opposed to existing literature, we do not assume any conditions on the relations between the payoff processes. We also show that both players have simple ε-optimal randomized stopp...

متن کامل

Some Time-invariant Stopping Rule Problems

Let X1,X2, . . . be and i.i.d. sequence. We consider three stopping rule problems for stopping the sequence of partial sums, Sn = ∑n 1 Xi, each of which has a timeinvariance for the payoff that allows us to describe the optimal stopping rule in a particularly simple form, depending on one or two parameters. For certain distributions of the Xn, the optimal rules are found explicitly. The three p...

متن کامل

The Sum-the-Odds Theorem with Application to a Stopping Game of Sakaguchi

The optimal stopping problem of maximizing the probability of stopping on the last success of a finite sequence of independent Bernoulli trials has been studied by Hill and Krengel (1992), Hsiau and Yang (2000) and Bruss (2000). The optimal stopping rule of Bruss stops when the sum of the odds of future successes is less than one. This Sum-the-Odds Theorem is extended in several ways. First, an...

متن کامل

Multiple Buying or Selling with Vector Offers

We consider a generalization of the house-selling problem to selling k houses. Let the offers, X1,X2, . . ., be independent, identically distributed k-dimensional random vectors having a known distribution with finite second moments. The decision maker is to choose simultaneously k stopping rules, N1, . . . , Nk , one for each component. The payoff is the sum over j of the jth component of XNj ...

متن کامل

On the Robust Optimal Stopping Problem

We study a robust optimal stopping problem with respect to a set P of mutually singular probabilities. This can be interpreted as a zero-sum controller-stopper game in which the stopper is trying to maximize its pay-off while an adverse player wants to minimize this payoff by choosing an evaluation criteria from P . We show that the upper Snell envelope Z of the reward process Y is a supermarti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012